Automatic Generation of State Invariants
نویسنده
چکیده
Automatic generation of state invariants, properties that hold in every reachable state of a state machine model, can be valuable in software development. Not only can such invariants be presented to system users for validation, in addition, they can be used as auxiliary assertions in proving other invariants. This paper describes an algorithm for the automatic generation of state invariants that, in contrast to most other such algorithms, which operate on programs, derives invariants from requirements speci cations. Generating invariants from requirements speci cations rather than programs has two advantages: 1) because requirements speci cations, unlike programs, are at a high level of abstraction, generation of and analysis using such invariants is easier, and 2) using invariants to detect errors during the requirements phase is considerably more cost-e ective than using invariants later in software development. To illustrate the algorithm, we use it to generate state invariants from requirements speci cations of an automobile cruise control system and a simple control system for a nuclear plant. The invariants are derived from speci cations expressed in the SCR (Software Cost Reduction) tabular notation. Keywords|requirements, speci cation, formal methods, invariants, veri cation, validation, software tools
منابع مشابه
Automatic Generation of Invariants in Processor Verification
A central task in formal verification is the definition of invariants, which characterize the reachable states of the system. When a system is finitestate, invariants can be discovered automatically. Our experience in verifying microprocessors using symbolic logic is that finding adequate invariants is extremely time-consuming. We present three techniques for automating the discovery of some of...
متن کامل3D rotation invariants by complex moments
A generalization of the complex moments from 2D to 3D is described. Group representation theory is used to construct 3D rotation invariants from them. The algorithm for automatic generating of the invariants of higher orders is proposed. An algorithm for automatic generation of higher order invariants is proposed. The linearly dependent invariants are eliminated. The invariants are experimental...
متن کاملAction + Frame Axioms (often) = Invariants
Recent work on the automatic generation of frame axioms from action specifications that have complete fluent change specifications is extended to extract action invariants. An action invariant expresses a property that is preserved by all actions of that class. The extraction is achieved by combining automatically generated frame axioms and the original action axioms relativised to those states...
متن کاملOn Isomorphism Invariants of Some Automatic Structures
In this paper we study structures defined by finite automata, called automatic structures. We provide a method that reduces the study of automatic structures to the study of automatic graphs. We investigate isomorphism invariants of automatic structures with an emphasis to equivalence relation structures, linearly ordered sets, and permutation structures.
متن کاملGeneration of Loop Invariants in Theorema by Combinatorial and Algebraic Methods
When generating verification conditions for a program, one is faced with one major task, namely with the situation when some additional assertions are needed (e.g. loop invariants). These assertions have the property that either they are invariant during execution of the program, or they depend on some other invariant properties. Therefore, automated formal verification is sensitive to the auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998